The Net Created from the Penrose Tiling Is Bilipschitz to the Integer Lattice
نویسندگان
چکیده
Let τ1 be the Penrose tiling on R 2 [G77] (using kites and darts) with edges of lengths 1 and φ, where φ is the golden ratio 1+ √ 5 2 . Let U be a square of the form [j1, j1 + l] × [j2, j2 + l] where l = 2, i, j1, j2 ∈ N. Notice that when we have a tiling of the plane (so that the diameter of its tiles is bounded) we can produce a separated net from it. We do it by placing one point in each tile, and remember to maintain the minimal distance property from (1.1). Obviously, by placing the points differently in the tiles we will get different separated nets, but all these nets will be in the same biLipschitz equivalence class. Thus we can say that every tiling creates a separated net. Let Y be the separated net which is created by the tiling τ1. For a number ρ > 0 we define as in [BK02] (1)
منابع مشابه
The Empire Problem in Penrose Tilings
Nonperiodic tilings of the plane exhibit no translational symmetry. Penrose tilings are a remarkable class of nonperiodic tilings for which the set of prototiles consists of just two shapes. The pentagrid method, introduced by N.G. de Bruijn, allows us to generate Penrose tilings by taking a slice of the integer lattice in five-dimensional space. The empire problem asks: Given a subset of a Pen...
متن کاملRectifying Separated Nets
In our earlier paper [BuK] (see also McMullen’s paper [M]), we constructed examples of separated nets in the plane R2 which are not biLipschitz equivalent to the integer lattice Z2. These examples gave a negative answer to a question raised by H. Furstenberg and M. Gromov. Furstenberg asked this question in connection with Kakutani equivalence for R2-actions, [F]. Return times for a section of ...
متن کاملSimilar Sublattices and Coincidence Rotations of the Root Lattice A4 and Its Dual
A natural way to describe the Penrose tiling employs the projection method on the basis of the root lattice A4 or its dual. Properties of these lattices are thus related to properties of the Penrose tiling. Moreover, the root lattice A4 appears in various other contexts such as sphere packings, efficient coding schemes and lattice quantizers. Here, the lattice A4 is considered within the icosia...
متن کاملPerfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph Λ of R. In contrast, there is just one 1-perfect code in Λ and one total perfect code in Λ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products Cm × Cn with parallel total perfect codes, and the d-...
متن کاملThe Game of Life Rules on Penrose Tilings: Still Life and Oscillators
John Horton Conway’s Game of Life [1, 4] is a simple two-dimensional, two state cellular automaton (CA), remarkable for its complex behaviour [1, 13]. That behaviour is known to be very sensitive to a change in the CA rules. Here we continue our investigations [7, 10, 11] into its sensitivity to changes in the lattice, by the use of an aperiodic Penrose tiling lattice [5, 12]. Section 18.1 desc...
متن کامل